منابع مشابه
First Order Extensions of Residue Classes and Uniform Circuit Complexity
The first order logic Ring(0,+, ∗, <) for finite residue class rings with order is presented, and extensions of this logic with generalized quantifiers are given. It is shown that this logic and its extensions capture DLOGTIME-uniform circuit complexity classes ranging from AC to TC. Separability results are obtained for the hierarchy of these logics when order is not present, and for Ring(0,+,...
متن کاملCircuit Complexity
Combinational circuits or shortly circuits are a model of the lowest level of computer hardware which is of interest from the point of view of computer science. Circuit complexity has a longer history than complexity theory. Complexity measures like circuit size and depth model sequential time, hardware cost, parallel time, and even storage space. This chapter contains an overview on the resear...
متن کاملOn the Arrangement Complexity of Uniform Trees
This paper studies the arrangement problem of uniform trees and shows that the arrangement complexity of a uniform tree is either (1) or ((lg n))(> 0). It also presents a recursive algorithm to compute the optimal complete arrangements for (1) arrangeable balanced uniform trees.
متن کاملUniform Characterizations of Non-Uniform Complexity Measures
Non-uniform complexity measures originated in automata and formal languages theory are characterized in terms of well-known uniform complexity classes. The initial index of languages is introduced by means of several computational models. It is shown to be closely related to context-free cost, boolean circuits, straight line programs, and Turing machines with sparse oracles and time or space bo...
متن کاملOn The Complexity of Quantum Circuit Manipulation
The stabilizer class of circuits, introduced by Daniel Gottesman, consists of quantum circuits in which every gate is a controlled-NOT (CNOT), Hadamard or phase gate [5]. These circuits have several interesting properties. For example, they are robust enough to allow for entangled states, yet they are known to be simulable in polynomial time by a classical computer. These circuits also naturall...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1981
ISSN: 0022-0000
DOI: 10.1016/0022-0000(81)90038-6